Coarse Correlated Equilibria in an Abatement Game
نویسندگان
چکیده
We consider the well-analyzed abatement game (Barrett 1994) and prove that correlation among the players (nations) can strictly improve upon the Nash equilibrium payoffs. As these games are potential games, correlated equilibrium — CE — (Aumann 1974, 1987) cannot improve upon Nash; however we prove that coarse correlated equilibria — CCE — (Moulin and Vial 1978) may do so. We compute the largest feasible total utility and hence the efficiency gain in any CCE in those games: it is achieved by a lottery over only two pure strategy profiles.
منابع مشابه
Coarse correlated equilibria in linear duopoly games
For duopoly models, we analyse the concept of coarse correlated equilibrium using simple symmetric devices that the players choose to commit to in equilibrium. In a linear duopoly game, we prove that Nash-centric devices, involving a sunspot structure, are simple symmetric coarse correlated equilibria. Any small unilateral perturbation from such a structure fails to be an equilibrium.
متن کاملCoarse Correlated Equilibria and Sunspots
For duopoly models, we analyse the concept of coarse correlated equilibrium using simple symmetric devices that the players choose to commit to in equilibrium. In a linear duopoly game, we prove that Nash-centric devices, involving a sunspot structure, are simple symmetric coarse correlated equilibria. Any small unilateral perturbation from such a structure fails to be an equilibrium.
متن کاملThe Limits of Smoothness: A Primal-Dual Framework for Price of Anarchy Bounds
We show a formal duality between certain equilibrium concepts, including the correlated and coarse correlated equilibrium, and analysis frameworks for proving bounds on the price of anarchy for such concepts. Our first application of this duality is a characterization of the set of distributions over game outcomes to which “smoothness bounds” always apply. This set is a natural and strict gener...
متن کاملCS 364 A : Algorithmic Game Theory
Last lecture we proved that coarse correlated equilibria (CCE) are tractable, in a satisfying sense: there are simple and computationally efficient learning procedures that converge quickly to the set of CCE. Of course, if anything in our equilibrium hierarchy (Figure 1) was going to be tractable, it was going to be CCE, the biggest set. The good researcher is never satisfied and always seeks s...
متن کاملCS 364 A : Algorithmic Game Theory Lecture # 18 : From External Regret to Swap Regret and the Minimax Theorem ∗
Last lecture we proved that coarse correlated equilibria (CCE) are tractable, in a satisfying sense: there are simple and computationally efficient learning procedures that converge quickly to the set of CCE. Of course, if anything in our equilibrium hierarchy (Figure 1) was going to be tractable, it was going to be CCE, the biggest set. The good researcher is never satisfied and always seeks s...
متن کامل